'Weak Dependency Graph [60.0]'
------------------------------
Answer:           YES(?,O(1))
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  p(f(f(x))) -> q(f(g(x)))
     , p(g(g(x))) -> q(g(f(x)))
     , q(f(f(x))) -> p(f(g(x)))
     , q(g(g(x))) -> p(g(f(x)))}

Details:         
  We have computed the following set of weak (innermost) dependency pairs:
   {  p^#(f(f(x))) -> c_0(q^#(f(g(x))))
    , p^#(g(g(x))) -> c_1(q^#(g(f(x))))
    , q^#(f(f(x))) -> c_2(p^#(f(g(x))))
    , q^#(g(g(x))) -> c_3(p^#(g(f(x))))}
  
  The usable rules are:
   {}
  
  The dependency graph contains no edges.
  
  We are done: the estimated dependency graph contains no edges and moreover, the usable rules are empty.